Skeleton Graph-Based Ultrasound-CT Non-Rigid Registration

نویسندگان

چکیده

Autonomous ultrasound (US) scanning has attracted increased attention, and it been seen as a potential solution to overcome the limitations of conventional US examinations, such inter-operator variations. However, is still challenging autonomously accurately transfer planned scan trajectory on generic atlas current setup for different patients, particularly thorax applications with limited acoustic windows. To address this challenge, we proposed skeleton graph-based non-rigid registration adapt patient-specific properties using subcutaneous bone surface features rather than skin surface. end, self-organization mapping successively used twice unify input point cloud extract key points, respectively. Afterward, minimal spanning tree employed generate graph connect all extracted points. appropriately characterize rib cartilage outline match source target cloud, path from optimized by maximally maintaining continuity throughout each rib. validate approach, manually one volunteer seven CT clouds patients. The results demonstrate that more effective robust in adapting inter-patient variations ICP (distance error mean $\pm$ SD: notation="LaTeX">$5.0\pm \rm{1.9}~mm$ vs notation="LaTeX">$8.6\pm \rm{6.7}~mm$ CTs).

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Non-rigid Image Registration Using Graph-cuts

Non-rigid image registration is an ill-posed yet challenging problem due to its supernormal high degree of freedoms and inherent requirement of smoothness. Graph-cuts method is a powerful combinatorial optimization tool which has been successfully applied into image segmentation and stereo matching. Under some specific constraints, graph-cuts method yields either a global minimum or a local min...

متن کامل

Landmark-Based Non-rigid Registration Via Graph Cuts

This paper presents an approach based on graph cuts initially used for motion segmentation that is being applied to the nonrigid registration problem. The main contribution of our method is the formulation of landmarks in the graph cut minimization framework. In the graph cut method, we add a penalty cost based on landmarks to the data energy. In the presence of a landmark, we adjust the T-link...

متن کامل

Compensation of brain shift during surgery using non-rigid registration of MR and ultrasound images

Background: Surgery and accurate removal of the brain tumor in the operating room and after opening the scalp is one of the major challenges for neurosurgeons due to the removal of skull pressure and displacement and deformation of the brain tissue. This displacement of the brain changes the location of the tumor relative to the MR image taken preoperatively. Methods: This study, which is done...

متن کامل

Cardiac Motion Analysis from Ultrasound Sequences Using Non-rigid Registration

In this article we propose a cardiac motion estimation technique that uses non-rigid registration to compute the dense cardiac displacement eld from 2D ultrasound sequences. Our method employs a semi-local deformation model which provides controlled smoothness. We apply a multiresolution optimization strategy for better speed and robustness. To further improve the accuracy, the sequence is regi...

متن کامل

Robust Multi-scale Non-rigid Registration of 3D Ultrasound Images

In this paper, we embed the minimization scheme of an automatic 3D non-rigid registration method in a multi-scale framework. The initial model formulation was expressed as a robust multiresolution and multigrid minimization scheme. At the finest level of the multiresolution pyramid, we introduce a focusing strategy from coarse-to-fine scales which leads to an improvement of the accuracy in the ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: IEEE robotics and automation letters

سال: 2023

ISSN: ['2377-3766']

DOI: https://doi.org/10.1109/lra.2023.3281267